A Study of the Context Tree Maximizing Method

نویسنده

  • Paul A.J. Volf
چکیده

One can adapt the context tree weighting method in such a way, that it will find the minimum description length model (MDL-model) that corresponds to the data. In this paper this new algorithm, the context tree maximizing algorithm, and a few modifications of the algorithm will be studied, in particular, its performance if we apply it for data compression.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Context-Tree Weighting and Maximizing: Processing Betas

The context-tree weighting method (Willems, Shtarkov, and Tjalkens [1995]) is a sequential universal source coding method that achieves the Rissanen lower bound [1984] for tree sources. The same authors also proposed context-tree maximizing, a two-pass version of the context-tree weighting method [1993]. Later Willems and Tjalkens [1998] described a method based on ratios (betas) of sequence pr...

متن کامل

Evaluation of estimation methods for parameters of the probability functions in tree diameter distribution modeling

One of the most commonly used statistical models for characterizing the variations of tree diameter at breast height is Weibull distribution. The usual approach for estimating parameters of a statistical model is the maximum likelihood estimation (likelihood method). Usually, this works based on iterative algorithms such as Newton-Raphson. However, the efficiency of the likelihood method is not...

متن کامل

Studying impressive parameters on the performance of Persian probabilistic context free grammar parser

In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...

متن کامل

مدل سازی تصمیم برای تشخیص و غربالگری سرطان اپی تلیال تخمدان

Background and Aim: The Ovarian epithelial cancer is one of the most deadly types of cancers in women.Thus, the purpose of this study was to investigate the most effective factors in predicting and detecting Ovarian cancer in the form of a decision tree to facilitate the Ovarian cancer diagnosis. Materials and Methods: The present study was a descriptive-developmental study. The main research ...

متن کامل

Context Tree Maximizing Reinforcement Learning

• Stochastic search approach [Nguyen et al 2011]: Parallel Tempering is utilized to find a good map based on the ΦMDP cost function. However, this approach is costly and does not guarantee finding the optimal state set or even a good one given a history •We propose an analytical and linear-time solution to this problem based on Context Tree Maximizing ∗Research School of Computer Science, Colle...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1995